Verification of constrained minima
نویسندگان
چکیده
منابع مشابه
automatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولApplet Verification Strategiesfor RAM-Constrained Devices
While bringing considerable flexibility and extending the horizons of mobile computing, mobile code raises major security issues. Hence, mobile code, such as Java applets, needs to be analyzed before execution. The byte-code verifier checks low-level security properties that ensure that the downloaded code cannot bypass the virtual machine’s security mechanisms. One of the statically ensured pr...
متن کاملSubspace-constrained supervector PLDA for speaker verification
In this paper, we consider speaker supervectors as observed variables and model them with a supervector probabilistic linear discriminant analysis model (SV-PLDA). By constraining the speaker and channel variability to lie in a common low-dimensional subspace, the model parameters and verification log likelihood ratios (LLR) can be computed in this lowdimensional subspace. Unlike the standard i...
متن کاملExperimental verification of minima in excited long-range Rydberg states of Rb2.
Recent theoretical studies with alkali atoms A* excited to high Rydberg states predicted the existence of ultra-long-range molecular bound states. Such excited dimers have large electric dipole moments which, in combination with their long radiative lifetimes, make them excellent candidates for manipulation in applications. This Letter reports on experimental investigations of the self-broadeni...
متن کاملTowards a Constrained-based Verification of Parameterized Cryptographic Protocols
Although many works have been dedicated to standard protocols like Needham-Schroeder very few address the more challenging class of group protocols. We present a synchronous model for group protocols, that generalizes standard protocol models by permitting unbounded lists inside messages. In this extended model we propose a correct and complete set of inference rules for checking security prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)00132-4